a1, a2, a3 = [int(i) for i in input().split()]
b1, b2, b3 = [int(i) for i in input().split()]
b = int(input())
k = 0
if (a1+a2+a3) % 5 == 0:
k+=(a1+a2+a3)//5
else:
f = (a1+a2+a3)//5
k += f+1
if (b1+b2+b3) % 10 == 0:
k += (b1+b2+b3)//10
else:
h = (b1+b2+b3)//10
k += h +1
if k <= b:
print("YES")
else:
print("NO")#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
int main() {
int n, a1, a2, a3, a, b1, b2, b3, b;
cin >> a1 >> a2 >> a3;
cin >> b1 >> b2 >> b3;
cin >> n;
a = a1 + a2 + a3;
b = b1 + b2 + b3;
a = ceil(a * 1.0 / 5);
b = ceil(b * 1.0 / 10);
if ((a + b) <= n)
cout << "YES";
else
cout << "NO";
return 0;
}1478B - Nezzar and Lucky Number | 228A - Is your horseshoe on the other hoof |
122A - Lucky Division | 1611C - Polycarp Recovers the Permutation |
432A - Choosing Teams | 758A - Holiday Of Equality |
1650C - Weight of the System of Nested Segments | 1097A - Gennady and a Card Game |
248A - Cupboards | 1641A - Great Sequence |
1537A - Arithmetic Array | 1370A - Maximum GCD |
149A - Business trip | 34A - Reconnaissance 2 |
59A - Word | 462B - Appleman and Card Game |
1560C - Infinity Table | 1605C - Dominant Character |
1399A - Remove Smallest | 208A - Dubstep |
1581A - CQXYM Count Permutations | 337A - Puzzles |
495A - Digital Counter | 796A - Buying A House |
67A - Partial Teacher | 116A - Tram |
1472B - Fair Division | 1281C - Cut and Paste |
141A - Amusing Joke | 112A - Petya and Strings |